The LAMA Planner Using Landmark Counting in Heuristic Search

نویسندگان

  • Silvia Richter
  • Matthias Westphal
چکیده

LAMA is a propositional planning system based on heuristic search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositions that must be true in every solution of a planning task. It builds on the Fast Downward Planning System, using non-binary (but finite domain) state variables, and multi-heuristic search. A weighted A∗ search is used with iteratively decreasing weights, so that the planner continues to search for plans of better quality until the search

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks

LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must be true in every solution of a planning task. LAMA builds on the Fast Downward planning system, using finite-domain rather than binary state variables and multi-heuristic search. The latter is employed to combine the la...

متن کامل

On the Use of Landmarks in LPG

Domain-Independent planning is notoriously a very hard search problem. In the literature, several techniques for search control have been proposed in the context of various planning formalisms. In particular, Landmark techniques have been widely used in the planning community in order to guide the search process or to define heuristic functions. A Landmark can be defined as a logical expression...

متن کامل

Viewing Landmarks as Temporally Extended Goals

Landmarks are facts that must hold true at some point in all solutions to a planning problem. The exploitation of landmarks and associated ordering constraints has been shown to be very effective in computing high-quality plans, quickly. Indeed the success of LAMA, winner of the 2008 International Planning Competition sequential satisficing track, can be attributed in some measure to its abilit...

متن کامل

LAMA 2008 and 2011 Silvia

LAMA is a propositional planning system based on heuristic search with landmarks. This paper describes two versions of LAMA that were entered into the 2011 International Planning Competition: the original LAMA as developed for the 2008 competition and a new re-implementation of LAMA that uses the latest version of the Fast Downward Planning Framework. Landmarks are propositions that must be tru...

متن کامل

Jasper: the Art of Exploration in Greedy Best First Search

LAMA-2011 (Richter and Westphal 2010) is the clear winner of the sequential satisficing track in the latest International Planning Competition (IPC-2011). It finds a first solution by Greedy Best-First Search (GBFS), and then continues to improve solutions using restarting weighted A* (Richter, Thayer, and Ruml 2010). Diverse Anytime Search (DAS) (Xie, Valenzano, and Müller 2013) is a metaalgor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009